| Module code | WTW 285 |
| Qualification | Undergraduate |
| Faculty | Faculty of Natural and Agricultural Sciences |
| Module content | Setting up and solving recurrence relations. Equivalence and partial order relations. Graphs: paths, cycles, trees, isomorphism. Graph algorithms: Kruskal, Prim, Fleury. Finite state automata. |
| Module credits | 12.00 |
| Programmes |
BIT Information Technology
BSc Information Technology Information and Knowledge Systems BSc(Computer Science) Computer Science BSc Applied Mathematics BSc Chemistry BSc Environmental and Engineering Geology BSc Environmental Sciences BSc Geography BSc Geoinformatics BSc Geology BSc Mathematical Statistics BSc Mathematics BSc Meteorology BSc Physics |
| Service modules | Faculty of Engineering, Built Environment and Information Technology Faculty of Education |
| Prerequisites | WTW 115 |
| Contact time | 1 tutorial per week, 2 lectures per week |
| Language of tuition | English |
| Academic organisation | Mathematics and Applied Maths |
| Period of presentation | Semester 2 |
Copyright © University of Pretoria 2024. All rights reserved.
Virtual Campus
Get Social With Us
Download the UP Mobile App